Numerical application and Turbo C program using the Gauss-Jordan Method

نویسندگان

  • Anghel Drugarin
  • Cornelia Victoria
چکیده

The article presents the general notions and algorithm about the Gauss-Jordan method. An eloquent example is given and the Turbo C program illustrated this method. We conclude that we can obtain by this method the determinant, by simple calculations and reducing the rounding errors Cuvinte cheie: metoda Gauss-Jordan, matricea inversă, limbaj de programare Turbo C, pivot. 1. Noţiuni generale Metoda eliminării în versiunea Gauss-Jordan, este o metodă de calcul a inversei unei matrice, care se rezumă la reducerea acesteia la matricea unitate, fapt datorită căruia se mai numeşte şi metoda diagonalizării. Această metodă se bazează pe o teoremă din algebra matriceală: Dacă o matrice nesingulară A poate fi redusă la matricea unitate I prin înmulţirea la stânga cu un şir de matrice, atunci inversa A 1 − se poate calcula prin înmulţirea lui I la stânga cu acelaşi şir de matrice în ordine inversă. 2. Algoritmul metodei Gauss-Jordan Algoritmul de inversare – cuprinde două procese de calcul derulate în paralel şi are n paşi: I. Se fac iniţializările :

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modal analysis of a turbo-pump shaft: An innovative suspending method to improve the results

Modal parameter extraction of high speed shafts is of critical importance in mechanical design of turbo-pumps. Due to the complex geometry and peripheral components of turbo-pumps, difficulties can arise in determination of modal parameters. In this study, modal properties of a turbo-pump shaft, was studied by experimental modal analysis, and using different excitation techniques. An innovative...

متن کامل

Turbo Decoding as Constrained Optimization

The turbo decoder was not originally introduced as a solution to an optimization problem. This has made explaining just why the turbo decoder performs as well as it does very difficult. Many authors have attempted to explain both the performance and convergence of the decoder, with varied success. In this document we show that the turbo decoder admits an exact interpretation as an iterative met...

متن کامل

Using the High-Level Based Program Interface to Facilitate the Large Scale Scientific Computing

This paper is to make further research on facilitating the large-scale scientific computing on the grid and the desktop grid platform. The related issues include the programming method, the overhead of the high-level program interface based middleware, and the data anticipate migration. The block based Gauss Jordan algorithm as a real example of large-scale scientific computing is used to evalu...

متن کامل

A Parallel Adaptive version of the Block-based Gauss-Jordan Algorithm

This paper presents a parallel adaptive version of the block-based Gauss-Jordan algorithm used in numerical analysis to invert matrices. This version includes a characterization of the workload of processors and a mechanism of its adaptive folding/unfolding. The application is implemented and experimented with MARS in dedicated and non-dedicated environments. The results show that an absolute e...

متن کامل

An Efficient Numerical Method for a Class of Boundary Value Problems, Based on Shifted Jacobi-Gauss Collocation Scheme

We present a numerical method for a class of boundary value problems on the unit interval which feature a type of exponential and product nonlinearities. Also, we consider singular case. We construct a kind of spectral collocation method based on shifted Jacobi polynomials to implement this method. A number of specific numerical examples demonstrate the accuracy and the efficiency of the propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1401.7962  شماره 

صفحات  -

تاریخ انتشار 2014